Subdivisions of Transitive Tournaments
نویسنده
چکیده
We prove that, for r ≥ 2 and n ≥ n(r), every directed graph with n vertices and more edges than the r-partite Turán graph T (r, n) contains a subdivision of the transitive tournament on r + 1 vertices. Furthermore, the extremal graphs are the orientations of T (r, n) induced by orderings of the vertex classes.
منابع مشابه
PACKING AND DECOMPOSITIONS IN TRANSITIVE TOURNAMENTS – PhD THESIS
In this thesis we shall deal with oriented graphs. The motivation for us is a result by Sali and Simonyi (see also a short proof by Gyárfás) where the existence of the decomposition of transitive tournaments on two isomorphic graphs is shown. In this thesis we start to study a problem of packing in transitive tournaments and we consider decompositions and partitions of transitive tournaments. T...
متن کاملUnavoidable tournaments
A basic result in Ramsey theory states that any tournament contains a “large” transitive subgraph. Since transitive tournaments contain only transitive subgraphs, it is natural to ask which subgraphs must appear in any large tournament that is “far” from being transitive. One result of this type was obtained by Fox and Sudakov who characterized the tournaments that appear in any tournament that...
متن کاملVertex-transitive tournaments of order a product of two distinct primes
In this paper, we begin a classification of the vertex-transitive tournaments of order pq where p and q are distinct odd primes. In particular we characterize the pq-circulant tournaments; see Theorem 4.3. Moreover, we determine 2-closed (in Wielandt’s sense) oddorder transitive permutation groups of degree p and pq by using the classifications of vertextransitive tournaments of order p and pq....
متن کاملDecomposing oriented graphs into transitive tournaments
For an oriented graph G with n vertices, let f(G) denote the minimum number of transitive subtournaments that decompose G. We prove several results on f(G). In particular, if G is a tournament then f(G) < 5 21n (1 + o(1)) and there are tournaments for which f(G) > n/3000. For general G we prove that f(G) ≤ bn/3c and this is tight. Some related parameters are also considered. AMS classification ...
متن کاملOn a generalization of transitivity for digraphs
In this paper we investigate the following generalization of transitivity: A digraph D is (m, n )-transitive whenever there is a path of length m from x to y there is a subset of n + I vertices of these m +I vertices which contain a path of length n from x toy. Here we study various properties of (m, n )-transitive digraphs. In particular, (m, I)-transitive tournaments are characterized. Their ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 21 شماره
صفحات -
تاریخ انتشار 2000